An optimal algorithm for approximate nearest neighbor searching fixed dimensions
نویسندگان
چکیده
منابع مشابه
An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions
In this papel; we present an approximate nearest neighbor search algorithm that use heuristics to decide whether o r not to access a node in the index tree based on three interesting data distribution properties. We demonstrate that the proposed algorithm significantly reduces the number of nodes accessed over the algorithms that have been proposed in earlier works. Also, it will be demonstrate...
متن کاملApproximate Nearest Neighbor Queries in Fixed Dimensions 1
Given a set of n points in d-dimensional Euclidean space, S E d , and a query point q 2 E d , we wish to determine the nearest neighbor of q, that is, the point of S whose Euclidean distance to q is minimum. The goal is to preprocess the point set S, such that queries can be answered as eeciently as possible. We assume that the dimension d is a constant independent of n. Although reasonably goo...
متن کاملRandomized Algorithm for Approximate Nearest Neighbor Search in High Dimensions
A randomized algorithm employs a degree of randomness as part of its logic with uniform random bits as an auxiliary input to guide its behavior, in the hope of achieving good average runtime performance over all possible choices of the random bits. In this paper, we formulate a randomized algorithm capable of finding approximate nearest neighbors, specifically in high dimensional datasets. The ...
متن کاملTowards Optimal ǫ-Approximate Nearest Neighbor Algorithms in Constant Dimensions
The nearest neighbor (NN) problem on a set of n points P , is to build a data structure that when given a query point q, finds p ∈ P such that for all p′ ∈ P , d(p, q) ≤ d(p′, q). In low dimensions (2 or 3), this is considered a solved problem, with techniques such as Voronoi diagrams providing practical, log-height tree structures. Finding algorithms that work in arbitrary dimension has been m...
متن کاملApproximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either their ability to reduce the data set that needs to be examined, or their ability to reduce the representation size of each data object. We first propose modifications to wellknown techniques to support the progressive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1998
ISSN: 0004-5411,1557-735X
DOI: 10.1145/293347.293348